The superregular graphs
نویسنده
چکیده
A regular graph is superregular if it has no vertices or if the subgraphs induced by the neighbors and by the nonneighbors of each vertex are superreg-ular. The superregular graphs are precisely the disjoint union of m isomorphic cliques, the Cartesian product of two isomorphic cliques, the ve-cycle, and the complements of these graphs.
منابع مشابه
On superregular matrices and MDP convolutional codes
Superregular matrices are a type of lower triangular Toeplitz matrix that arises in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that the only submatrices having a zero determinant are those whose determinants are trivially zero due to the lower triangular structure. In this paper, we discuss how superregular...
متن کاملA new class of superregular matrices and MDP convolutional codes
This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can possibly be nonsingular due to the lower block triangular structure are nonsingular. We present a new class of matrices that are superregular over a sufficien...
متن کاملSuperregular Matrices and the Construction of Convolutional Codes having a Maximum Distance Profile
Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has a zero determinant unless it is trivially zero due to the lower triangular structure. In this paper, we discuss how superregular matrices may be used to cons...
متن کاملSuperregular matrices and applications to convolutional codes
The main results of this paper are twofold: the first one is a matrix theoretical result. We say that a matriz is superregular if all of its minors that are not trivially zero are nonzero. Given a a × b, a ≥ b, superregular matrix over a field, we show that if all of its rows are nonzero then any linear combination of its columns, with nonzero coefficients, has at least a − b + 1 nonzero entrie...
متن کاملSuperregular solitonic solutions: a novel scenario for the nonlinear stage of modulation instability
We describe a general N -solitonic solution of the focusing nonlinear Schrödinger equation in the presence of a condensate by using the dressing method. We give the explicit form of oneand two-solitonic solutions and study them in detail as well as solitonic atoms and degenerate solutions. We distinguish a special class of solutions that we call regular solitonic solutions. Regular solitonic so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 23 شماره
صفحات -
تاریخ انتشار 1996